Hardness of Finding Small Shortest Path Routing Conflicts
نویسنده
چکیده
Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing paths forms a valid routing and, if this is not the case, to find a small subset of the given paths that cannot be shortest paths simultaneously for any routing lengths. In this paper we show that it is NP-hard to approximate the size of the smallest shortest path conflict by a factor less than 7/6.
منابع مشابه
On the Hardness of Finding Small Shortest Path Routing Conflicts
Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing pat...
متن کاملFinding Small Administrative Lengths for Shortest Path Routing
We study the problem of finding small integer arc lengths in a digraph such that some given paths are uniquely determined shortest paths. This Inverse Shortest Paths (ISP) problem arises in the planning of shortest path networks. We present an O(|V |)-approximation algorithm for ISP and show that minimizing the longest arc or the longest path length is APX -hard. Thus, deciding if a given path ...
متن کاملA Combinatorial Approximation Algorithm for Selecting the Gate Sizes from Finite Sets in VLSI Circuits
In this paper, we consider a problem of VLSI design occurring in the routing phase. The problem is to determine the optimal size selection for the gates in a combinatorial circuit which uses the problem of finding a shortest path in an oriented acyclic graph for making certain updates between any two successive iterations. For this NP-hard problem, we give an approximation algorithm.
متن کاملA polynomial-time algorithm to find shortest paths with recourse
The Shortest Path with Recourse Problem involves finding the shortest expected-length paths in a directed network each of whose arcs have stochastic traversal lengths (or delays) that become known only upon arrival at the tail of that arc. The traveler starts at a given source node, and makes routing decisions at each node in such a way that the expected distance to a given sink node is minimiz...
متن کاملThe Shortest Path Problem with k-Cycle Elimination (k ≥ 3): Improving Branch and Price Algorithms for Vehicle Routing and Scheduling
The elementary shortest path problem with resource constraints (ESPPRC) is a widely used modeling tool in formulating vehicle routing and crew scheduling applications, see e.g. [3]. The ESPPRC consists of finding shortest paths from a source to all other nodes of a network that do not contain any cycles, i.e. duplicate nodes. The ESPPRC occurs as a subproblem of an enclosing problem and is used...
متن کامل